Theoretical basis for numerically exact three-dimensional time-domain algorithms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theoretical Basis for Numerically Exact Three - Dimensional Time - Domain Algorithms

The members of the Committee appointed to examine the dissertation of CHRISTOPHER LINCOLN WAGNER find it satisfactory and recommend that it be accepted.

متن کامل

A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem

In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...

متن کامل

Fast Interpolation Algorithms for Real-Time Three-Dimensional Cardiac Ultrasound

Real-time three-dimensional (RT3D) ultrasound technique based on matrix phased array transducers is likely to become predominant for dynamic screening in cardiac and obstetric practice. With these transducers large data volumes are acquired in spherical coordinates and require resampling to be visualized in Cartesian coordinates. A fast 3D resampling method was implemented and five interpolatio...

متن کامل

Space-time radial basis function collocation method for one-dimensional advection-diffusion problem

The parabolic partial differential equation arises in many application of technologies. In this paper, we propose an approximate method for solution of the heat and advection-diffusion equations using Laguerre-Gaussians radial basis functions (LG-RBFs). The results of numerical experiments are compared with the other radial basis functions and the results of other schemes to confirm the validit...

متن کامل

Algorithms for Segmenting Time Series

As with most computer science problems, representation of the data is the key to ecient and eective solutions. Piecewise linear representation has been used for the representation of the data. This representation has been used by various researchers to support clustering, classication, indexing and association rule mining of time series data. A variety of algorithms have been proposed to obtain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Physics

سال: 2005

ISSN: 0021-9991

DOI: 10.1016/j.jcp.2004.11.009